Clause Sharing in Parallel MaxSAT

نویسندگان

  • Ruben Martins
  • Vasco M. Manquinho
  • Inês Lynce
چکیده

In parallel MaxSAT solving, sharing learned clauses is expected to help to further prune the search space and boost the performance of a parallel solver. However, not all learned clauses should be shared since it could lead to an exponential blow up in memory and to sharing many irrelevant clauses. The main question is which learned clauses should be shared among the different threads. This paper reviews the existing heuristics for sharing learned clauses, namely, static and dynamic heuristics. Moreover, a new heuristic for clause sharing is presented based on freezing shared clauses. Shared clauses are only incorporated into the solver when they are expected to be useful in the near future. Experimental results show the importance of clause sharing and that the freezing heuristic outperforms other clause sharing heuristics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Clause Sharing in Deterministic Parallel Maximum Satisfiability

Multicore processors are becoming the dominant platform in modern days. As a result, parallel Maximum Satisfiability (MaxSAT) solvers have been developed to exploit this new architecture. Sharing learned clauses in parallel MaxSAT is expected to help to further prune the search space and boost the performance of a parallel solver. Yet, so far it has not been made clear which learned clauses sho...

متن کامل

A Clause Tableau Calculus for MaxSAT

We define a clause tableau calculus for MaxSAT, prove its soundness and completeness, and describe a tableau-based algorithm for MaxSAT. Given a multiset of clauses , the algorithm computes both the minimum number of clauses that can be falsified in , and an optimal assignment. We also describe how the algorithm can be extended to solve weighted MaxSAT and weighted partial MaxSAT.

متن کامل

Using Learnt Clauses in maxsat

maxsat is an optimization version of SAT capable of expressing a variety of practical problems. maxsat solvers have been designed to take advantage of many of the successful techniques of SAT solvers. However, the most important technique of modern SAT solvers, clause learning, has not been utilized since learnt clauses cannot be soundly added to a maxsat theory. In this paper we present a new ...

متن کامل

Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers

As satisfiability (SAT) solver performance has improved, so has their complexity, which make it more likely that SAT solvers contain bugs. One important source of increased complexity is clause sharing in parallel SAT solvers. SAT solvers can emit a proof of unsatisfiability to gain confidence that their results are correct. Such proofs must contain deletion information in order to check them e...

متن کامل

An Exact Algorithm Based on MaxSAT Reasoning for the Maximum Weight Clique Problem

Recently, MaxSAT formalisms are shown very effective for solving combinatorial optimization problems. An importantMaxSAT formalism is weighted partialMaxSAT dealingwith hard clauses, which must be satisfied in all solutions, and soft clauses, which are weighted and can be falsified. In this paper, we apply weighted partial MaxSAT to solve the maximum weight clique (MWC) problem. We first study ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012